Unification of Analytical Approaches to Engineering Problems
نویسندگان
چکیده
منابع مشابه
Unification of Two Approaches to Teacher Training in Iran: A Critical Review of Farhangiyan University’s Charter
Unification of Two Approaches to Teacher Training in Iran: A Critical Review of Farhangiyan University’s Charter N. Moosaapoor, Ph.D.* The historical facts imbedded in the century-old Iranian experience in teacher training reveal two different and coexisting approaches. One is a university-based four-year program aiming at training high school teachers, while the other is a two-year pro...
متن کاملAnalytical Approaches for Solving Neutron Transport Problems
The exact solutions for stationary and non-stationary neutron transport equations corresponding to various source functions are presented. The semi-infinite medium is considered to have a specular-reflecting boundary with angular dependent externally-incident flux. Some adjustments were made to agree the neutron transport theory with astrophysical applications.
متن کاملA relationship between three analytical approaches to nonlinear problems
0. Introduction A number of mathematical techniques have been applied for solving nonlinear problems. Energy Balance [1–3], homotopy analysis [4], variational iteration [5], homotopy perturbation [6,7], the max–min approach [8,9], frequency amplitude formulation [10] and perturbation methods [11] are the most prominent approaches that those have been employed for solving a large number of nonli...
متن کاملDesign Approaches for Visualization of Engineering Problems
This work presents the development of technology-assisted problem solving (TAPS) packages at University Tenaga Nasional (UNITEN). This project is the further work of the development of interactive multimedia based packages targeted for students having problems in understanding and visualizing the Engineering Mechanics Dynamics problems. One facet of the project is the development of Engineering...
متن کاملOn Problems Dual to Unification
In this paper, we investigate a problem dual to the unification problem, namely theCommon Term (CT) problem for string rewriting systems. Our main motivation was in computing fixed points in systems, such as loop invariants in programming languages. We show that the fixed point problem is reducible to the common term problem. We also prove that the common term problem is undecidable for dwindli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1960
ISSN: 0028-0836,1476-4687
DOI: 10.1038/187359a0